منابع مشابه
Hierarchical universal coding
In an earlier paper, we proved a strong version of the redundancy-capacity converse theorem of universal coding, stating that for `most' sources in a given class, the universal coding redundancy is essentially lower bounded by the capacity of the channel induced by this class. Since this result holds for general classes of sources, it extends Rissanen's strong converse theorem for parametric fa...
متن کاملTraffic Scene Analysis using Hierarchical Sparse Topical Coding
Analyzing motion patterns in traffic videos can be exploited directly to generate high-level descriptions of the video contents. Such descriptions may further be employed in different traffic applications such as traffic phase detection and abnormal event detection. One of the most recent and successful unsupervised methods for complex traffic scene analysis is based on topic models. In this pa...
متن کاملUniversal prediction and universal coding
Although prediction schemes which are named \universal" are now abundant, very little has been addressed as to the de nition of universal prediction. This paper addresses for -nary ( 2) sequences the criteria of successful universal prediction and the prediction schemes which achieve the goals. We propose the following criteria: for any probability measures in a given measure class, the error p...
متن کاملUniversal Source Coding
The material covered in this thesis falls mainly in two parts. In the first part, which is found in chapter II, the foundations of source coding are considered. A careful introduction to the notion of codes for symbols, blocks and infinite sequences is given. The classical notion of a stationary ergodic source is then introduced as a natural concept arising when assuming limiting statistical co...
متن کاملSimplistic Universal Coding.
A conceptually simple coding method may be described as follows. The source sequence is parsed into xed length blocks and a list of these blocks is placed in a dictionary. In the lossless case, the dictionary is transmitted and each successive block is encoded by giving its dictionary location. In the lossy case, the smallest collection of blocks such that every member of the dictionary is with...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Information Theory
سال: 1996
ISSN: 0018-9448
DOI: 10.1109/18.532877